Robot exploration with combinatorial auctions
نویسندگان
چکیده
We study how to coordinate a team of mobile robots to visit a number of given targets in partially unknown terrain. Robotics researchers have studied singleitem auctions (where robots bid on single targets) to perform this exploration task but these do not take synergies between the targets into account. We therefore design combinatorial auctions (where robots bid on bundles of targets), propose different combinatorial bidding strategies and compare their performance with each other, as well as to singleitem auctions and an optimal centralized mechanism. Our computational results in TeamBots, a multi-robot simulator, indicate that combinatorial auctions generally lead to significantly superior team performance than single-item auctions, and generate very good results compared to an optimal centralized mechanism.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملAn Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...
متن کاملA Data-Driven Exploration of Bidder Behavior in Continuous Combinatorial Auctions
Combinatorial auctions – in which bidders can bid on combinations of goods – have been shown to increase the economic efficiency of a trade when goods have complementarities. However, the computational complexity of determining winners coupled with the cognitive complexity of formulating combinatorial bids has prevented this mechanism from reaching the online marketplace. Drawing from recent re...
متن کاملAuction – Based Robot Coordination
We study how to improve sequential single-item auctions that assign targets to robots for exploration tasks such as environmental clean-up, space-exploration, and search and rescue missions. We exploit the insight that the resulting travel distances are small if the bidding and winner-determination rules are designed to result in hillclimbing, namely to assign an additional target to a robot in...
متن کاملA Data-Driven Exploration of Bidder Strategies in Continuous Combinatorial Auctions
Combinatorial auctions, in which bidders can bid on combinations of assets (commonly referred to as bundles or packages), represent an innovative yet complex market mechanism that can enhance the ability to allocate multiple assets efficiently when the values of the assets exhibit synergies (e.g., “I will pay $100 if I get both matching end tables but only $40 for either one separately”). Altho...
متن کامل